Deriving Production Rules for Incremental View

نویسندگان

  • Stefano Ceri
  • Jennifer Widom
چکیده

It is widely recognized that production rules in database systems can be used to automatically maintain derived data such as views. However, writing a correct set of rules for eeciently maintaining a given view can be a dii-cult and ad-hoc process. We provide a facility whereby a user deenes a view as an SQL select expression, from which the system automatically derives set-oriented production rules that maintain a materialization of that view. The maintenance rules are triggered by operations on the view's base tables. Generally, the rules perform incremental maintenance: the materialized view is modiied according to the sets of changes made to the base tables, which are accessible through logical tables provided by the rule language. However, for some operations substantial recomputation may be required. We give algorithms that, based on key information , perform syntactic analysis on a view deenition to determine when eecient maintenance is possible.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deriving Production Rules for Incremental View Maintenance

It is widely recognized that production rules in database systems can be used to automatically maintain derived data such as views. However, writing a correct set of rules for e ciently maintaining a given view can be a di cult and ad-hoc process. We provide a facility whereby a user de nes a view as an SQL select expression, from which the system automatically derives set-oriented production r...

متن کامل

Deriving Incremental Production Rules for Deductive Data

We show that the production rule mechanism provided by active database systems can be used to quickly and easily implement the logic rule interface of deductive database systems. Deductive rules specify derived relations using Datalog with built-in predicates and strati ed negation; the deductive rules are compiled automatically into production rules. We present a materialized approach, in whic...

متن کامل

Incremental Evaluation of Nest and Unnest Operators in Nested Relations

Incremental expressions are important in materialized view maintenance, query optimization, and constraint checking. In this paper, we derive incremental expressions for the nest and unnest operators in nested relations. The expressions are derived for both general nested relations using set operators for updating relations and for partition-normal form (PNF) relations using extended set operat...

متن کامل

Incremental Mining of Association Rules: A Survey

The association rule mining has been very useful in many applications such as, market analysis, web data analysis, decision making, knowing customer trends etc. In transactional databases as time advances, new transactions are being added and obsolete transactions are discarded. Incremental mining deals with generating association rules based on available knowledge (obtained from mining of prev...

متن کامل

Incremental Evaluation of Tabled Logic Programs

Tabling has emerged as an important evaluation technique in logic programming. Currently, changes to a program (due to addition/deletion of rules/facts) after query evaluation compromise the completeness and soundness of the answers in the tables. This paper presents incremental algorithms for maintaining the freshness of tables upon addition or deletion of facts. Our algorithms improve on exis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991